Dynamic Routing Tables Using Simple Balanced Search Trees
نویسندگان
چکیده
Various schemes for high-performance IP address lookups have been proposed recently. Pre-computations are usually used by the special designed IP address lookup algorithms for better performance in terms of lookup speed and memory requirement. However, the disadvantage of the pre-computation based schemes is that when a single prefix is added or deleted, the entire data structure may need to be rebuilt. Rebuilding the entire data structure seriously affects the update performance of a backbone router and thus not suitable for dynamic routing tables. In this paper, we develop a new dynamic routing table algorithm. The proposed data structure is a collection of balanced binary search trees. The search, insertion, and deletion operations can be finished in O(log N) time, where N is the number of prefixes in a routing table. Comparing with the best existing dynamic routing table algorithm which is PBOB (prefix binary tree on binary tree), our experiment results using real routing tables show that the proposed scheme performs better in all aspect.
منابع مشابه
New Combinatorial Properties and Algorithms for AVL Trees
In this thesis, new properties of AVL trees and a new partitioning of binary search trees named core partitioning scheme are discussed, this scheme is applied to three binary search trees namely AVL trees, weight-balanced trees, and plain binary search trees. We introduce the core partitioning scheme, which maintains a balanced search tree as a dynamic collection of complete balanced binary tre...
متن کاملIdeal Hash Trees
Hash Trees with nearly ideal characteristics are described. These Hash Trees require no initial root hash table yet are faster and use significantly less space than chained or double hash trees. Insert, search and delete times are small and constant, independent of key set size, operations are O(1). Small worst-case times for insert, search and removal operations can be guaranteed and misses co...
متن کاملComputing All the Best Swap Edges Distributively
In systems using shortest-path routing tables, a single link failure is enough to interrupt the message transmission by disconnecting one or more shortestpath spanning trees. The on-line recomputation of an alternative path or of the entire new shortest path trees, rebuilding the routing tables accordingly, is rather expensive and causes long delays in the message’s transmission [5, 10]. Hopefu...
متن کاملDynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations
We give new methods for maintaining a data structure that supports ray-shooting and shortest-path queries in a dynamically changing connected planar subdivision S . Our approach is based on a new dynamic method for maintaining a balanced decomposition of a simple polygon via geodesic triangles. We maintain such triangulations by viewing their dual trees as balanced trees. We show that rotations...
متن کاملAverage-Case Analysis on Simple Families of Trees Using a Balanced Probability Model
Casas. R., J. Diaz and C. Martinez, Average-case analysis on simple families of trees using a balanced probability model, Theoretical Computer Science 117 (1993) 99-112. We extend the binary search tree model of probability to simply generated families of trees. In the resulting statistics, well-balanced trees are more likely than linear trees. Using this balanced model, analyses are more compl...
متن کامل